Two-dimensional individual clustering model
نویسنده
چکیده
in an open bounded domain Ω ⊂ R2, where u(t, x) > 0, ω(t, x) ∈ R2 and E denote the population density, the average velocity of dispersing individuals, and the individual net reproduction rate, respectively. In this model, the individuals are assumed to disperse randomly in space (δ ∆u) with a bias −∇ · (u ω) in the direction of increasing reproduction rate, the term ε ∆ω acting as a mollifier to smooth out any sharp local variation in ∇E(u).
منابع مشابه
A feature group weighting method for subspace clustering of high-dimensional data
This paper proposes a new method to weight subspaces in feature groups and individual features for clustering high-dimensional data. In this method, the features of high-dimensional data are divided into feature groups, based on their natural characteristics. Two types of weights are introduced to the clustering process to simultaneously identify the importance of feature groups and individual ...
متن کاملSteel Consumption Forecasting Using Nonlinear Pattern Recognition Model Based on Self-Organizing Maps
Steel consumption is a critical factor affecting pricing decisions and a key element to achieve sustainable industrial development. Forecasting future trends of steel consumption based on analysis of nonlinear patterns using artificial intelligence (AI) techniques is the main purpose of this paper. Because there are several features affecting target variable which make the analysis of relations...
متن کاملHigh-Dimensional Unsupervised Active Learning Method
In this work, a hierarchical ensemble of projected clustering algorithm for high-dimensional data is proposed. The basic concept of the algorithm is based on the active learning method (ALM) which is a fuzzy learning scheme, inspired by some behavioral features of human brain functionality. High-dimensional unsupervised active learning method (HUALM) is a clustering algorithm which blurs the da...
متن کاملUniformity and homogeneity-based hierarchical clustering
This paper presents a clustering algorithm for dot patterns in n-dimensional space. The n-dimensional space often represents a multivariate (nf -dimensional) function in a ns-dimensional space (ns + nf = n). The proposed algorithm decomposes the clustering problem into the two lower dimensional problems. Clustering in nf -dimensional space is performed to detect the sets of dots in n-dimensiona...
متن کاملCharacter-Level Neural Translation for Multilingual Media Monitoring in the SUMMA Project
The paper steps outside the comfort-zone of the traditional NLP tasks like automatic speech recognition (ASR) and machine translation (MT) to addresses two novel problems arising in the automated multilingual news monitoring: segmentation of the TV and radio program ASR transcripts into individual stories, and clustering of the individual stories coming from various sources and languages into s...
متن کاملA Joint Semantic Vector Representation Model for Text Clustering and Classification
Text clustering and classification are two main tasks of text mining. Feature selection plays the key role in the quality of the clustering and classification results. Although word-based features such as term frequency-inverse document frequency (TF-IDF) vectors have been widely used in different applications, their shortcoming in capturing semantic concepts of text motivated researches to use...
متن کامل